Fast Algorithm of Truncated Burrows-Wheeler Transform Coding for Data Compression of Sensors

Modiications of the Burrows and Wheeler Data Compression Algorithm

Modifications of the Burrows and Wheeler Data Compression Algorithm

In 1994 Burrows and Wheeler [3] described a universal data compression algorithm (BWalgorithm, for short) which achieved compression rates that were close to the best known compression rates. Due to it’s simplicity, the algorithm can be implemented with relatively low complexity. Fenwick [5] described ideas to improve the efficiency (i.e. the compression rate) and complexity of the BW-algorithm...

Dynamic Burrows-Wheeler Transform

The Burrows-Wheeler Transform is a building block for many text compression applications and self-index data structures. It reorders the letters of a text T to obtain a new text bwt(T ) which can be better compressed. This forward transform has been intensively studied over the years, but a major problem still remains: bwt(T ) has to be entirely recomputed whenever T is modified. In this articl...

Burrows Wheeler Compression

Author’s Note. The material of this chapter, while quoting extensively from other work, is in part a summary of my own experience and thoughts in working with the Burrows-Wheeler compression algorithm. Some of it is accordingly rather less formal in style than might otherwise be the case, as I give more personal opinions on various aspects. Where my own work already appears in the public domain...

Image compression with B-tree coding algorithm enhanced by data modelling with Burrows-Wheeler transformation

The paper shows that the partial differential based compression framework, Edge Enhancing Diffusion Compression (EEDC) on high compression ratios can come close to or even be better than present compression standard – JPEG2000 thus presenting a novel method for image compression. In this paper EEDC will be enhanced by changing its data coding, i.e. Huffman coding will be changed with an entropy...